Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization

نویسندگان

چکیده

Abstract The focus in this paper is interior-point methods for bound-constrained nonlinear optimization, where the system of equations that arise are solved with Newton’s method. There a trade-off between solving Newton systems directly, which give high quality solutions, and many approximate computationally less expensive but lower solutions. We propose partial full solutions to systems. specific solution depends on estimates active inactive constraints at solution. These sets each iteration estimated by basic heuristics. inexpensive, whereas linear needs be size determined estimate In addition, we motivate suggest two Newton-like approaches based an intermediate step consists theoretical setting introduced asymptotic error bounds given. also numerical results investigate performance within beyond framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interior-Point Methods for PDE-Constrained Optimization

In applied sciences PDEs model an extensive variety of phenomena. Typically the final goal of simulations is a system which is optimal in a certain sense. For instance optimal control problems identify a control to steer a system towards a desired state. Inverse problems seek PDE parameters which are most consistent with measurements. In these optimization problems PDEs appear as equality const...

متن کامل

Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization

Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability. In this paper, we consider PDE-constrained optimization problems with bound constraints on the state and control variables, and their representation on the discrete level as quadratic programming problems. To...

متن کامل

Direct Solution of Linear Systems of Size 109 Arising in Optimization with Interior Point Methods

Solution methods for very large scale optimization problems are addressed in this paper. Interior point methods are demonstrated to provide unequalled efficiency in this context. They need a small (and predictable) number of iterations to solve a problem. A single iteration of interior point method requires the solution of indefinite system of equations. This system is regularized to guarantee ...

متن کامل

A Numerical Study of Active-Set and Interior-Point Methods for Bound Constrained Optimization

This papers studies the performance of several interior-point and activeset methods on bound constrained optimization problems. The numerical tests show that the sequential linear-quadratic programming (SLQP) method is robust, but is not as effective as gradient projection at identifying the optimal active set. Interiorpoint methods are robust and require a small number of iterations and functi...

متن کامل

solution of security constrained unit commitment problem by a new multi-objective optimization method

چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Optimization and Applications

سال: 2021

ISSN: ['0926-6003', '1573-2894']

DOI: https://doi.org/10.1007/s10589-021-00265-8